A fair buffer allocation scheme

نویسندگان

  • Juha Heinänen
  • Kalevi Kilkki
چکیده

An appropriate service for data traffic in ATM networks requires large buffers in network nodes. However, large buffers without a proper allocation scheme may lead to an unsatisfactory quality of service. Most present allocation schemes either necessitate a complicated queueing system or they do not offer a sufficient fairness. This paper describes a rather simple buffer management scheme that results in fair allocation of bandwidth among competing connections by using only a FIFO buffer. The performance and fairness of the allocation scheme has been analysed by means of a simulation program.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VLSI implementation of a fairness ATM buffer system

This paper presents a VESI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in Asynchronous Transfer Mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in network...

متن کامل

A stateless active queue management scheme for approximating fair bandwidth allocation

We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...

متن کامل

Fair Scheduling in Internet Routers

ÐInput buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling(i FS) scheme for input buffered switc...

متن کامل

CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...

متن کامل

Performance improvement of dynamic buffered ATM switch

Performance of ATM networks depends on switch performance and architecture. This paper presents a simulation study of a new dynamic allocation of input buffer space in ATM switching elements. The switching elements are composed of input and output buffers which are used to store received and forwarded cells, respectively. Efficient and fair use of buffer space in an ATM switch is essential to g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1998